On the controllability of clustered Scale-Free networks
نویسندگان
چکیده
منابع مشابه
Highly clustered scale-free networks.
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the...
متن کاملEnhancement of cooperation in highly clustered scale-free networks.
We study the effect of clustering on the organization of cooperation by analyzing the evolutionary dynamics of the "Prisoner's Dilemma" on scale-free networks with a tunable value of clustering. We find, on the one hand, that a high value of the clustering coefficient produces an overall enhancement of cooperation in the network, even for a very high temptation to defect. On the other hand, hig...
متن کاملControllability of multiplex, multi-time-scale networks.
The paradigm of layered networks is used to describe many real-world systems, from biological networks to social organizations and transportation systems. While recently there has been much progress in understanding the general properties of multilayer networks, our understanding of how to control such systems remains limited. One fundamental aspect that makes this endeavor challenging is that ...
متن کاملSandpile on scale-free networks.
We investigate the avalanche dynamics of the Bak-Tang-Wiesenfeld sandpile model on scale-free (SF) networks, where the threshold height of each node is distributed heterogeneously, given as its own degree. We find that the avalanche size distribution follows a power law with an exponent tau. Applying the theory of the multiplicative branching process, we obtain the exponent tau and the dynamic ...
متن کاملScale-free networks on lattices.
We suggest a method for embedding scale-free networks, with degree distribution Pk approximately k(-lambda), in regular Euclidean lattices accounting for geographical properties. The embedding is driven by a natural constraint of minimization of the total length of the links in the system. We find that all networks with lambda>2 can be successfully embedded up to a (Euclidean) distance xi which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2019
ISSN: 2051-1329
DOI: 10.1093/comnet/cnz014